Constraint 2 is relaxed
Constraint 3 is not relaxed
Constraint 4 is not relaxed
Constraint 5 is not relaxed
Constraint 6 is not relaxed
The time to read the input and initialise the problem = 1281 ms

Iteration 1
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 110 ms
The lower bound solution is:
z = 3068.000000 + 715.000000 = 3783.000000
The time to read the lower bound solution = 0 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 66187.000000
The optimal solution has not been found yet.

Iteration 2
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 3068.000000 + 10075.600000 = 13143.600000
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 66187.000000
The optimal solution has not been found yet.

Iteration 3
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -4705.645600 + 18032.110000 = 13326.464400
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 20522.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 4
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -3065.063468 + 17470.858223 = 14405.794755
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 20522.000000
The optimal solution has not been found yet.

Iteration 5
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1670.568654 + 16993.794214 = 15323.225560
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 20522.000000
The optimal solution has not been found yet.

Iteration 6
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -589.958300 + 16588.289808 = 15998.331508
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 19173.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 7
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -79.137540 + 16131.137545 = 16052.000005
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 16052.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.
The duality gap is acceptably small.
 The current upper (and lower) bound are taken as optimal.
The best upper bound = 16052.000000, the best lower bound = 16052.000005
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 12671 ms
The total time to calculate the lower bounds with CPLEX = 158 ms
The total time to calculate the upper bounds with CPLEX = 31 ms
The total time to create the lower bound problems = 91 ms
The total time to read the lower bound solutions = 16 ms
The total time to check if computing the upper bounds are needed = 0 ms
The total time to create the upper bound problems = 47 ms
The total time to read the upper bound solutions = 16 ms 

The best upper bound found = 16052.000000, the best lower bound found = 16052.000005
Therefore the duality gap is 0.000000%
